Interpolation by bivariate linear splines

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scattered data interpolation by bivariate splines with higher approximation order

Given a set of scattered data, we usually use a minimal energy method to find Lagrange interpolation based on bivariate spline spaces over a triangulation of the scattered data locations. It is known that the approximation order of the minimal energy spline interpolation is only 2 in terms of the size of triangulation. To improve this order of approximation, we propose several new schemes in th...

متن کامل

Local Lagrange Interpolation by Bivariate C 1 Cubic Splines

Lagrange interpolation schemes are constructed based on C 1 cubic splines on certain triangulations obtained from checkerboard quad-rangulations. x1. Introduction Given a triangulation 4 of a simply connected polygonal domain , the space of C 1 cubic splines is deened by S 1 3 (4) := fs 2 C 1 (() : sj T 2 P 3 , all T 2 4g; where P 3 is the space of cubic bivariate polynomials. In this paper we ...

متن کامل

Interpolation of fuzzy data by using flat end fuzzy splines

In this paper, a new set of spline functions called ``Flat End Fuzzy Spline" is defined to interpolate given fuzzy data. Some important theorems on these splines together with their existence and uniqueness properties are discussed. Then numerical examples are presented to illustrate the differences between of using our spline and other interpolations that have been studied before.

متن کامل

Constrained Interpolation via Cubic Hermite Splines

Introduction In industrial designing and manufacturing, it is often required to generate a smooth function approximating a given set of data which preserves certain shape properties of the data such as positivity, monotonicity, or convexity, that is, a smooth shape preserving approximation.  It is assumed here that the data is sufficiently accurate to warrant interpolation, rather than least ...

متن کامل

Interpolation by Convex Quadratic Splines

Algorithms are presented for computing a quadratic spline interpolant with variable knots which preserves the monotonicity and convexity of the data. It is also shown that such a spline may not exist for fixed knots.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 2000

ISSN: 0377-0427

DOI: 10.1016/s0377-0427(00)00374-5